A CellML simulation compiler and code generator using ODE solving schemes
نویسندگان
چکیده
منابع مشابه
Compiler Generator for Creating MOF-compliant Source Code Models
Instead of the source code level, improving and maintaining the program code is more efficient when performed on model level. Source code is used to create the program model if it is not available. The new source code is created after performing the necessary changes in the model. To a certain extent, CASE (Computer Aided Software Engineering) tools are supporting this kind of round-trip engine...
متن کاملEecient Specialisation in Prolog Using a Hand-written Compiler Generator Eecient Specialisation in Prolog Using a Hand-written Compiler Generator
The so called \cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evaluation of both functional and imperative languages. This paper demonstrates that this approach is also applicable to partial evaluation of logic programming languages, also called partial deduction. Self-application has not been ...
متن کاملAn Efficient XML Parser Generator Using Compiler Compiler Technique
This paper describes design issues and experiment results of an efficient XML parser generator, Xsong. A traditional compiler construction technique is applied to Xsong so that it realizes both expressiveness and efficiency for parsing XML documents. To compare with the performance of DOM based programs, SAX based programs and a program generated by Xsong, experiments were designed. The experim...
متن کاملA Provably Correct Compiler Generator
We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated compilers emit absolute code for an abstract RISC machine language that currently is assembled into code for the SPARC and the HP Precision Architecture. Our machine language needs no run-time type-checking and is thus mor...
متن کاملSolving a system of 2D Burgers' equations using Semi-Lagrangian finite difference schemes
In this paper, we aim to generalize semi-Lagrangian finite difference schemes for a system of two-dimensional (2D) Burgers' equations. Our scheme is not limited by the Courant-Friedrichs-Lewy (CFL) condition and therefore we can apply larger step size for the time variable. Proposed schemes can be implemented in parallel very well and in fact, it is a local one-dimensional (LOD) scheme which o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Source Code for Biology and Medicine
سال: 2012
ISSN: 1751-0473
DOI: 10.1186/1751-0473-7-11